Network constraints on learnability of probabilistic motor sequences
نویسندگان
چکیده
Human learners are adept at grasping the complex relationships underlying incoming sequential input. In the present work, we formalize complex relationships as graph structures derived from temporal associations in motor sequences. Next, we explore the extent to which learners are sensitive to key variations in the topological properties inherent to those graph structures. Participants performed a probabilistic motor sequence task in which the order of button presses was determined by the traversal of graphs with modular, lattice-like, or random organization. Graph nodes each represented a unique button press and edges represented a transition between button presses. Results indicate that learning, indexed here by participants’ response times, was strongly mediated by the graph’s meso-scale organization, with modular graphs being associated with shorter response times than random and lattice graphs. Moreover, variations in a node’s number of connections (degree) and a node’s role in mediating long-distance communication (betweeness centrality) impacted graph learning, even after accounting for level of practice on that node. These results demonstrate that the graph architecture underlying temporal sequences of stimuli fundamentally constrain learning, and moreover that tools from network science provide a valuable framework for assessing how learners encode complex, temporally structured information. ar X iv :1 70 9. 03 00 0v 1 [ qbi o. N C ] 9 S ep 2 01 7
منابع مشابه
Capacitor Placement in Distorted Distribution Network Subject to Wind and Load Uncertainty
Utilizing capacitor banks is very conventional in distribution network in order for local compensation of reactive power. This will be more important considering uncertainties including wind generation and loads uncertainty. Harmonics and non-linear loads are other challenges in power system which complicates the capacitor placement problem. Thus, uncertainty and network harmonics have been con...
متن کاملLoss Reduction in a Probabilistic Approach for Optimal Planning of Renewable Resources
Clean and sustainable renewable energy technology is going to take responsibility of energy supply in electrical power systems. Using renewable sources improve the environment and reduce dependence on oil and other fossil fuels. In distribution power system, utilizing of wind and solar DGs comprises some advantages; consist of loss and emission reduction, and also improvement of voltage profile...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملA mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues
Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...
متن کاملIntegrating heuristic preferences into a neural understanding system
We have been developing a neural natural language understanding system oriented towards the extraction of information relevant to a task. We have implemented a version of this system for an air travel reservation task. We have studied systems that map input sequences to output sequences, and conceived a recurrent neural system for conceptual decoding. Robustness, learnability and flexible integ...
متن کامل